A lower bound of the strongly unique minimal projection constant of lninfinity, n>=3

نویسندگان

  • W. Odyniec
  • M. P. Prophet
چکیده

In this paper we give a lower bound for the strongly unique minimal projection (with norm one) constant (SUP-constant) onto some (n − k)-dimensional subspaces of l ∞ (n ≥ 3, 1 ≤ k ≤ n−1). By Proposition 1 of this paper, each k-dimensional Banach space with polytope unit ball with m (k − 1)-faces is isometrically isomorphic to a subspace of lk+m−1 ∞ . As such the aforementioned estimation can be applied to spaces other than l ∞. We also include a conjecture about the exact calculations of SUP-constants in particular settings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On strongly 2-multiplicative graphs

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

متن کامل

Minimal solution of fuzzy neutrosophic soft matrix

The aim of this article is to study the concept of unique solvability of max-min fuzzy neutrosophic soft matrix equation and strong regularity of fuzzy neutrosophic soft matrices over Fuzzy Neutrosophic Soft Algebra (FNSA). A Fuzzy Neutrosophic Soft Matrix (FNSM) is said to have Strong, Linear Independent (SLI) column (or, in the case of fuzzy neutrosophic soft square matrices, to be strongly r...

متن کامل

A bound for Feichtinger conjecture

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...

متن کامل

The lower bound for the number of 1-factors in generalized Petersen graphs

‎In this paper‎, ‎we investigate the number of 1-factors of a‎ ‎generalized Petersen graph $P(N,k)$ and get a lower bound for the‎ ‎number of 1-factors of $P(N,k)$ as $k$ is odd‎, ‎which shows that the‎ ‎number of 1-factors of $P(N,k)$ is exponential in this case and‎ ‎confirms a conjecture due to Lovász and Plummer (Ann‎. ‎New York Acad‎. ‎Sci‎. ‎576(2006)‎, ‎no‎. ‎1‎, ‎389-398).

متن کامل

A Bound for the Nilpotency Class of a Lie Algebra

In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Approximation Theory

دوره 145  شماره 

صفحات  -

تاریخ انتشار 2007